Decidability and universality of quasiminimal subshifts
نویسندگان
چکیده
منابع مشابه
Decidability and Universality of Quasiminimal Subshifts
We show that there exists a universal subshift having only a finite number of minimal subsystems, refuting a conjecture in [Delvenne, Kůrka, Blondel, ’05]. We then introduce the still smaller class of quasiminimal subshifts, having finitely many subsystems in total. With N-actions, their theory essentially reduces to the theory of minimal systems, but with Zactions, the class is much larger. We...
متن کاملUniversality and Almost Decidability
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a decidable and generic (i.e. a set of natural density one) set whose intersection with S is decidable. Every decidable set is almost decidable, but the conve...
متن کاملDecidability and Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing’s work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. Universality of a system is defined as undecidability of a model-checking problem. For Turing machines, counter machines and tag systems, our defini...
متن کاملUniversality and decidability of number-conserving cellular automata
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the definition of the property to include cellular automata with any set of states in Z, and show that they can be always extended to “usual” NCCA with contiguous state...
متن کاملOn quasiminimal excellent classes
A careful exposition of Zilber’s quasiminimal excellent classes and their categoricity is given, leading to two new results: the Lω1,ω(Q)definability assumption may be dropped, and each class is determined by its model of dimension א0. Boris Zilber developed quasiminimal excellent classes in [Zil05], in order to prove that his conjectural description of complex exponentiation was categorical. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2017
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2017.05.017